package com.leecode.base;

/**
 * @Author: yaoshubin
 * @Date: 2022-12-11 16:38
 * @description :  自定义Node  单链表结构
 */
public class Node {

    Node pre;
    int value;
    Node next;


    Node(int value) {
        this.value = value;
    }

    Node(int value, Node pre, Node next) {
        this.value = value;
        this.pre = pre;
        this.next = next;
    }


    public Node getPre() {
        return pre;
    }


    public void setPre(Node pre) {
        this.pre = pre;
    }

    public int getValue() {
        return value;
    }

    public void setValue(int value) {
        this.value = value;
    }

    public Node getNext() {
        return next;
    }

    public void setNext(Node next) {
        this.next = next;
    }
}
